Correlated Voting
نویسندگان
چکیده
We study the social choice problem where a group of n voters report their preferences over alternatives and a voting rule is used to select an alternative. We show that when the preferences of voters are positively correlated according to the Kendall-Tau distance, the probability that any scoring rule is not ex post incentive compatible (EPIC) goes to zero exponentially fast with the number of voters, improving over the previously known rate of 1/ √ n for independent preferences. Motivated by rank-order models from machine learning, we introduce two examples of positively-correlated models, namely Conditional Mallows and Conditional Plackett-Luce. Conditional Mallows satisfies Kendall-Tau correlation and fits our positive result. We also prove that Conditional Plackett-Luce becomes EPIC exponentially quickly.
منابع مشابه
Measuring voting power in games with correlated votes using Bahadur's parametrisation
We introduce a method of measuring voting power in simple voting games with correlated votes using the Bahadur parameterisation. With a method for measuring voting power with correlated votes, we can address a question of practical importance. Given that most of the applied power analysis is carried out with either the Penrose-Banzhaf or the ShapleyShubik measures of power, what happens when yo...
متن کاملIncentive-Compatible Voting Rules with Positively Correlated Beliefs
We study the consequences of positive correlation of beliefs in the design of voting rules in a model with an arbitrary number of voters. We propose a notion of positive correlation, based on the likelihood of agreement of the k best alternatives (for any k) of two orders called TS correlation. We characterize the set of Ordinally Bayesian Incentive-Compatible (OBIC) (d’Aspremont and Peleg (198...
متن کاملDouble voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملVoting Power of Teams Working Together
Voting power determines the “power” of individuals who cast votes; their power is based on their ability to influence the winning-ness of a coalition. Usually each individual acts alone, casting either all or none of their votes and is equally likely to do either. This paper extends this standard “random voting” model to allow probabilistic voting, partial voting, and correlated team voting. We...
متن کامل